Dynamic programming: An interactive approach
نویسندگان
چکیده
منابع مشابه
An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...
متن کاملAn Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our approach updates the answer sets after incremental changes to the rule base. This is intended for application domains in which the answer set program is developed or updated during the run time of the system but answer...
متن کاملAn Optimal Tax Relief Policy with Aligning Markov Chain and Dynamic Programming Approach
Abstract In this paper, Markov chain and dynamic programming were used to represent a suitable pattern for tax relief and tax evasion decrease based on tax earnings in Iran from 2005 to 2009. Results, by applying this model, showed that tax evasion were 6714 billion Rials**. With 4% relief to tax payers and by calculating present value of the received tax, it was reduced to 3108 billion Rials. ...
متن کاملBankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach
In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1982
ISSN: 0022-247X
DOI: 10.1016/0022-247x(82)90265-7